A linear assignment formulation of the multiattribute decision problem
نویسندگان
چکیده
منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولTightening a Discrete Formulation of the Quadratic Assignment Problem
The quadratic assignment problem is a well studied and notoriously difficult combinatorial problem. Recently, a discrete linear formulation of the quadratic assignment problem was presented that solved five previously unsolved instances from the quadratic assignment library, QAPLIB, to optimality. That formulation worked especially well on sparse instances. In this paper we show how to tighten ...
متن کاملA quadratic assignment formulation of the molecular conformation problem
The molecular conformation problem is discussed, and a concave quadratic global minimization approach for solving it is described. This approach is based on a quadratic assignment formulation of a discrete approximation to the original problem.
متن کاملA linear formulation with O(n) variables for the quadratic assignment problem
We present an integer linear formulation that uses the so-called “distance variables” to solve the quadratic assignment problem (QAP). The model involves O(n) variables. Valid equalities and inequalities are additionally proposed. We further improved the model by using metric properties as well as an algebraic characterization of the Manhattan distance matrices that Mittelman and Peng [28] rece...
متن کاملEquality of complexity classes P and NP: Linear programming formulation of the quadratic assignment problem
In this paper, we present a first linear programming formulation of the Quadratic Assignment Problem (QAP). The proposed linear program is a network flow-based model with 0(n9) variables and 0(n7) constraints, where n is the number of assignments. Hence, it provides for the solution of the QAP in polynomial-time and represents therefore, a proof of the equality of the computational complexity c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Revue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle
سال: 1976
ISSN: 0397-9350
DOI: 10.1051/ro/197610v200211